package com.fr.lintcode;

public class Q463 {
	 /**
     * @param A: an integer array
     * @return: nothing
     */
    public void sortIntegers(int[] A) {
        // write your code here
    	for(int i = 0; i < A.length; i++) {
    		for(int j = i+1; j < A.length; j ++) {
    			if(A[i] > A[j]) {
    				int a = A[i];
    				A[i] = A[j];
    				A[j] = a;
    			}
    		}
    	}
    }
}
